Logic Based and Imperative Coordination Languages
نویسنده
چکیده
This paper deals with the cooperation between programming systems that belong to diierent paradigms. We explain our approach towards coordination in the context of the recently proposed notions of mega-programming and coordination languages. We show how our logic based parallel language V P L (Vienna Parallel Logic) can be decomposed into a computation and a coordination part. The language constructs necessary for the coordination of autonomous software systems include a highly abstract communication mechanism, an advanced transaction model and concurrency. The coordination part is generalized so that it can be embedded into programming languages of diier-ent paradigms, for example into imperative languages. This concept resembles the Linda approach in many aspects and we compare the two. A main diierence is that instead of adding orthogonal constructs that are in no way related to the host language, we embed coordination into the language so the result is a new language that does not change the programming style of the underlying host language.
منابع مشابه
Logic Channels: A Coordination Approach to Distributed Programming
* This work has been carried out in the framework of the Spanish CICYT project TIC94-0930-C02-01. Abstract In this paper, we present a new coordination model and a small set of programming notations for distributed programming that can be integrated in very different programming languages (imperative, declarative or object oriented). Both together, allow the development of distributed programs ...
متن کاملAdding Logic Programming Behaviour to the World Wide Web
Imperative programming has largely dominated both aspects ofWeb programming: adding sophisticated interactive behaviours to the Web and constructing programswhich interact with theWeb. Mostmobile code languages such as Java are based on the imperative programming paradigm. Imperative languages are widely used for building Web browsers and information gathering tools. The focus of much programmi...
متن کاملIntroduction to Expression Refinement
We present an outline of a refinement calculus for strict functional programming, based on four-valued logic and equational reasoning. The languages imitates the features known from the imperative Refinement Calculus in a language of expressions.
متن کاملAnonymous Variables in Imperative Languages
In this paper, we bring anonymous variables into imperative languages. Anonymous variables represent don’t-care values and have proven useful in logic programming. To bring the same level of benefits into imperative languages, we describe an extension to C wth anonymous variables.
متن کاملFlemming Nielson: Annotated Type and Effect Systems
Program analysis offers static techniques for predicting safe and computable approximations to the set of values or behaviours arising dynamically during computation; this may be used to validate program transformations or to generate more efficient code. The flow based approach includes the traditional data flow analysis techniques for mainly imperative languages, but also the control flow ana...
متن کامل